EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption

Order-preserving encryption (OPE) is a cryptographic primitive that preserves the order of plaintexts. In past few years, many OPE schemes were proposed to solve problem executing range queries in encrypted databases. However, leaks some certain information (for example, ciphertext), so it vulnerable attacks. Subsequently, order-revealing (ORE) was by Boneh et al. (Eurocrypt 2015) as generalization order-preserving encryption. It breaks through limitation numeric plaintext. implements ciphertext comparison for any specific form plaintext publicly computable function. this article, we aim design new ORE scheme which reduces leakages and practicality terms length time. We first propose hybrid model named xmlns:xlink="http://www.w3.org/1999/xlink">HybridORE . Then, an improved xmlns:xlink="http://www.w3.org/1999/xlink">EncodeORE achieves acceptable security appropriate length. They both explore encode strategy encoding into different parts apply suitable algorithms each part according its characteristics reduce leakages. Compared with typical CLWW (FSE 2016) Lewi-Wu (CCS large domain, they have fewer The experiment shows very practical.